Abstract: The algorithm takes an input a directed acyclic graph G = (V, E) and two vertices s and t and returns the number of paths from s to t in G.

Keywords: directed acyclic graph, paths, queues.